package Leetcode第一期;

/**
 * @author : K k
 * @date : 20:53 2020/9/1
 */
public class 打印从1到最大的n位数_17 {
    public int[] printNumbers(int n) {
        int pow = (int) Math.pow(10, n);
        int length=pow-1;
        int[] res=new int[length];
        for (int i=0;i<length-1;i++){
            res[i]=i+1;
        }
        return res;

    }
}
